Analysis of short term fairness and its impact on packet level performance

نویسندگان

  • Gang Uk Hwang
  • Fumio Ishizaki
چکیده

In this paper, we consider the one-bit feedback scheduler with a threshold in a wireless network. Due to its feedback reduction structure, the one-bit feedback scheduler has been studied as one of good candidates implementable in a practical wireless network, and it is important to determine the threshold value of the one-bit feedback scheduler. To solve this problem, network throughput and/or long term fairness are mainly considered in previous studies. However, when we consider the packet level performance such as packet overflow probability, both short term fairness and long term fairness should be considered because both significantly affect the packet level performance. Accordingly, if the scheduler can not provide a higher level of short term fairness to MSs, the packet level performances of MSs are significantly different from MS to MS even when the scheduler provides strict long term fairness. To see the effect of short term fairness on the packet level performance, we analyze short term fairness and long term fairness of the one-bit feedback scheduler with a given threshold value. We also analyze throughput of each mobile station and network throughput. Based on our analytic results, we investigate the joint effects of short term fairness and network throughput on the packet level performances of MSs. We also show that there is a trade-off between short term fairness and network throughput in the one-bit feedback scheduling through numerical studies. Email addresses: [email protected] (Gang Uk Hwang), [email protected] (Fumio Ishizaki) Preprint submitted to Performance Evaluation March 26, 2010

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness

This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...

متن کامل

Underpricing, Ownership and Liquidity of Initial Public Offers (IPO) and Their Impact on Performance of IPO Stocks in Equity Markets of India

Paper studies the impact of the liquidity, underpricing and ownership up on both the short term and long term performance of the Initial Public Offer (IPO) stocks in the equity markets of India. Empirical analysis is undertaken to study the impact of liquidity, underpricing and ownership on Performance of IPO stocks. Multiple regression analysis is undertaken for analyzing the impact. It is fou...

متن کامل

Statistical Time-Access Fairness Index of One-Bit Feedback Fair Scheduler

Since the utilization of multiuser diversity in wireless networks can increase the information theoretic capacity, much attention has been paid to schedulers exploiting multiuser diversity. It is known that there exists a tradeoff between the capacity and fairness achieved by schedulers exploiting multiuser diversity. Due to its good balance between the capacity and fairness, the one-bit feedba...

متن کامل

A Study of Short-Term Fairness in Wireless MAC Protocols

In this paper, we study short-term fairness in distributed, contention-based wireless medium access control (MAC) protocols. While most MAC protocols provide fairness among contending stations in the long term, they are not fair over shorter time scales. We rst demonstrate short-term unfairness of CSMA/CA using packet-level traces collected from an in-bulding wireless LAN network. We also analy...

متن کامل

Tandem queue weighted fair smooth scheduling

Network devices supporting 100G links are in demand to meet the communication requirements of computing nodes in datacenters and warehouse computers. In this paper, we propose TQ and TQ-Smooth, two lightweight, fair schedulers that accommodate an arbitrarily large number of requestors and are suitable for ultrahigh-speed links. We show that our first algorithm, TQ, as well its predecessor, DRR,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Perform. Eval.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2010